Summary not available
» Research Fields:
Algorithms
Computational Complexity
Graph Theory
Stringology
Graph Drawing
» Research Groups: Graph Drawing Research Group
» Related Faculties:
Dr. M. Kaykobad
Dr. Md. Saidur Rahman
Dr. Masud Hasan
Dr. M. Sohel Rahman
Dr. Sadia Sharmin
Tahmid Hasan
Sheikh Azizul Hakim
» Related Links:
http://cse.buet.ac.bd/research/group/gd/
| 1. | Md. Saidur Rahman, S. Ahmed, A survey on pairwise compatibility graphs, AKCE International Journal of Graphs and Combinatorics, , , 2020. |
|---|---|
| 2. | Shaheena Sultana, Md. Saidur Rahman, L-shaped point set embeddings of high-degree plane graphs, AKCE International Journal of Graphs and Combinatorics, , , 2019. |
| 3. | A. H. M. Kamal, Mohammad Mahfuzul Islam, A New Histogram-Shifting-Imitated Embedding Scheme, Journal of Computer Engineering, 1(2), 82-86, 2018. |
| 4. | Chinmay Bepery, Mohammad Mahfuzul Islam, Md. Mahbubur Rahman, Asma Akter Maria, Amina Nasrin Sumyea, Index Based Gap Position Least Count Forward Backward Multiple Pattern Matching Algorithm, Journal of Computer Engineering, 1(2), 41-48, 2018. |
| 5. | Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano, Enumerating Floorplans with Columns , Md. Saidur Rahman, Shin-Ichi Nakano, IEICE TRANS. FUNDAMENTALS, E101-A, 1392-1397, 2018. |
| 6. | Shaheena Sultana, Md. Saidur Rahman, Realizability of graphs as triangle cover contact graphs, Theoretical Computur Science, 720, 24-35, 2018. |
| 7. | Shaheena Sultana, Md. Iqbal Hossain, Md. Saidur Rahman, Nazmun Nessa Moon, Tahsina Hashem, On triangle cover contact graphs, Computational Geometry: Theory and Applications, 69, 31-38, 2018. |
| 8. | Md. Mahbubul Hasan, A. S. Islam, M. Sohel Rahman, Ayon Sen, Palindromic Subsequence Automata and Longest Common Palindromic Subsequence, Mathematics in Computer Science, 11(2), 219–232, 2017. [paper link] |
| 9. | S. M. Ferdous, M. Sohel Rahman, Solving the Minimum Common String Partition Problem with the Help of Ants, Mathematics in Computer Science, 11(2), 233–249, 2017. [paper link] |
| 10. | Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman, Debajyoti Mondal, A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs, J. Graph Algorithms Appl., 21(3), 341-352, 2017. |
| 11. | Ali Alatabbi, A. S. Islam, M. Sohel Rahman, Jamie Simpson, William Smyth, Enhanced covers of regular and indeterminate strings using prefix tables, J. Automata, Languages and Combinatorics, 21(3), 131-147, 2016. [paper link] |
| 12. | Ali Alatabbi, Jackie Daykin, Juha Kärkkäinen, M. Sohel Rahman, William Smyth, V-order: new combinatorial properties and a simple comparison algorithm, Discrete Applied Mathematics, 215, 41- 46, 2016. [paper link] |
| 13. | F. T. Zohora, M. Sohel Rahman, "An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications.", Theoretical Computer Science, , , 2016. |
| 14. | Ali Alatabbi, M. Sohel Rahman, W.F. Smyth, Computing Covers Using Prefix Tables, Discrete Applied Mathematics, 212, 2-9, 2016. |
| 15. | Ali Alatabbi, Alessio Langiu, M. Sohel Rahman, Algorithms for Longest Common Abelian Factors, International Journal of Foundations of Computer Science, 27(5), 529-544, 2016. [paper link] |
| 16. | Ali Alatabbi, M. Sohel Rahman, W.F. Smyth, Inferring an indeterminate string from a prefix graph, Journal of Discrete Algorithms, 32(-), 6-13, 2015. |
| 17. | Md. Iqbal Hossain, Md. Saidur Rahman, Good spanning trees in graph drawing, Theoretical Computer Science, 607, 149-165, 2015. |
| 18. | Md. Khaledur Rahman, M. Sohel Rahman, Prefix and suffix transreversals on binary and ternary strings, Journal of Discrete Algorithms, 33, 160-170, 2015. |
| 19. | Masud Hasan, Atif Hasan Rahman, Md. Khaledur Rahman, M. Sohel Rahman, Mahfuza Sharmin, Rukhsana Yeasmin, Pancake flipping and sorting permutations, Journal of Discrete Algorithms, 33, 139-149, 2015. |
| 20. | S.M. Ferdous, M. Sohel Rahman, An Integer Programming Formulation of the Minimum Common String Partition Problem, PLOS One, 10(7), e0130266, 2015. |
| 21. | Sumaiya Iqbal, M. Kaykobad, M. Sohel Rahman, Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees, Swarm and Evolutionary Computation, 24(-), 50-64, 2015. |
| 22. | Effat Farhana, M. Sohel Rahman, Constrained sequence analysis algorithms in computational biology, Information Sciences, 295, 247-257, 2015. |
| 23. | Ali Alatabbi, J. W. Daykin, M. Sohel Rahman, W.F. Smyth, Simple Linear Comparison of Strings in V-Order, Fundamenta Informaticae, To Appear, , 2015. |
| 24. | Md. Mahbubul Hasan, A. S. Islam, Mohammad Saifur Rahman, M. Sohel Rahman, Order preserving pattern matching revisited, Pattern Recognition Letters, 55, 15-21, 2015. [paper link] |
| 25. | Md. Iqbal Hossain, Md. Saidur Rahman, Straight-Line Monotone Grid Drawings of Series-Parallel Graphs, Discrete Mathematics, Algorithms and Applications, 7(2), , 2015. |
| 26. | Stephane Durocher, Debajyoti Mondal, Md. Saidur Rahman, On graphs that are not PCGs, Theoretical Computer Science, 571, 78-87, 2015. |
| 27. | S.B. Ahsan, S.P Aziz, M. Sohel Rahman, Longest Common Subsequence Problem for Run-Length-Encoded Strings, Journal of Computers, 9(8), 1769-1775, 2014. |
| 28. | M. Tasnim, Shahriar Rouf, M. Sohel Rahman, A CLONALG-based Approach for the Set Covering Problem, Journal of Computers, 9(8), 1787-1795, 2014. |
| 29. | A.H.M.M Rahman, M. Sohel Rahman, Effective Sparse Dynamic Programming Algorithms for Merged and Block Merged LCS Problems, Journal of Computers, 9(8), 1743-1754, 2014. |
| 30. | M. Crochemore, A. Langiu, M. Sohel Rahman, Indexing a sequence for mapping reads with a single mismatch, Phil. Trans. R. Soc. A, 372, 20130167, 2014. |
| 31. | M. Sohel Rahman, M. Kaykobad, J. S. Firoz, New Sufficient Conditions for Hamiltonian Paths, The Scientific World Journal, 2014, ID: 743431, 2014. |
| 32. | Pritom Ahmed, Costas Iliopoulos, A. S. Islam, M. Sohel Rahman, The swap matching problem revisited, Theoretical Computer Science, 557(6), 34-49, 2014. |
| 33. | M.T.I Aumi, M.T. Moosa, M. Sohel Rahman, Pattern Matching in Indeterminate and Arc-Annotated Sequences, Recent Patents on DNA and Gene Sequences, 7(2), 96-104, 2013. |
| 34. | T.M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz Rimpi, Inferring Strings from Cover Arrays, Discrete Mathematics, Algorithms and Applications (DMAA), 5(2), , 2013. |
| 35. | Pritom Ahmed, A. S. Islam, M. Sohel Rahman, A graph-theoretic model to solve the approximate string matching problem allowing for translocations, Journal of Discrete Algorithms, 23, 143-156, 2013. |
| 36. | Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides, Acyclic coloring with few division vertices, J. Discrete Algorithms, 23, 42-53, 2013. |
| 37. | Md. Manzurul Hasan, Md. Saidur Rahman, Muhammad Rezaul Karim, Box-Rectangular Drawings of Planar Graphs, Jounal of Graph Algorithms and Applications, 17(6), 629-646, 2013. |
| 38. | Johra Muhammad Moosa, M. Sohel Rahman, F. T. Zohora, Computing a Longest Common Subsequence that is Almost Increasing on Sequences Having No Repeated Elements, Journal of Discrete Algorithms, Volume 20, 12-20, 2013. |
| 39. | Muhammad Rashed Alam, M. Sohel Rahman, A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem, Information Processing Letters, 113(13), 470-476, 2013. |
| 40. | Amit Kumar Dutta, Masud Hasan, M. Sohel Rahman, Prefix transpositions on binary and ternary strings, Information Processing Letters, 113(8), 265-270, 2013. |
| 41. | Sammi Abida Salma, Md. Saidur Rahman, Md. Iqbal Hossain, Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs, Journal of Graph Algorithms and Applications (JGAA), 17(2), 81-102, 2013. |
| 42. | Muhammad Rashed Alam, M. Sohel Rahman, The substring inclusion constraint longest common subsequence problem can be solved in quadratic time, Journal of Discrete Algorithms, 17, 67-73, 2012. |
| 43. | Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman, Acyclic colorings of graph subdivisions revisited, Journal of Discrete Algorithms, 16, 90-103, 2012. |
| 44. | Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman, Computing a Longest Common Palindromic Subsequence, Fundamenta Informaticae, , 1–12, 2012. |
| 45. | Tanveer Awal, Md. Saidur Rahman, A Linear Algorithm for Resource Four-partitioning Four-connected Planar Graphs, AKCE International Journal of Graphs and Combinatorics, 9(1), 11-20, 2012. |
| 46. | Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz Rimpi, Indeterminate string inference algorithms, Journal of Discrete Algorithms, 10, 23-34, 2012. |
| 47. | T. M. Moosa, M. Sohel Rahman, Improved Algorithms for the Point-Set Embeddability problem for Plane 3-Trees, Discrete Mathematics, Algorithms and Applications (DMAA), 4(1), , 2012. |
| 48. | M. Crochemore , C. Iliopoulos, M. Kubica, M. Sohel Rahman, German Tischler and Tomasz Wallen. Improved Algorithms for the Range Next Value Problem and Applications, Theor. Comput. Sci., 434, 23-34, 2012. |
| 49. | J. W. Chan, C. S. Iliopoulos, S. Michalakopoulos, M. Sohel Rahman, Exact and Approximate Rhythm Matching Algorithms, International Journal on Digital Libraries, , , 2012. |
| 50. | S.I. Ahmed, Masud Hasan, M.A. Islam, Cutting a Convex Polyhedron out of a Sphere, Graphs and Combinatorics, 27(3), 307-319, 2011. |
| 51. | T.C. Biedl,, Masud Hasan, A. Lopez-Ortiz, Reconstructing convex polygons and polyhedra from edge and face counts in orthogonal projections, International Journal of Computational Geometry and Applications, 22(2), 215-239, 2011. |
| 52. | T.C. Biedl, Masud Hasan, Alejandro Lopez-Ortiz, Efficient viewpoint selection for silhouettes of convex polyhedra, Comutational Geometry: Theory and Application, 44(8), 399-408, 2011. |
| 53. | J.S. Firoz, Masud Hasan, A. Z. Khan, M. Sohel Rahman, The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(nlog n)$ Time, Journal of Computational Biology, 18(8), 1007-1011, 2011. |
| 54. | Masud Hasan, S. M. S. Hossain, M. M. Rahman, M. Sohel Rahman, Solving Minimum Hitting Set Problem and Generalized Exact Cover Problem with Light Based Devices, Int. Journ. of Unconventional Computing, 7(1-2), 125-140, 2011. |
| 55. | S. B. Ahsan, T. M. Moosa, M. Sohel Rahman, Shampa Shahriyar, Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded, INFOCOMP Journal of Computer Science, 10(3), 48-55, 2011. |
| 56. | Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-ichi Nakano, Generating all triangulations of plane graphs, Journal of Graph Algorithms and Applications, , 457-482, 2011. |
| 57. | Masud Hasan, S. M. S. Hossain, M. M. Rahman, M. Sohel Rahman, Solving the Generalized Subset Sum Problem with a Light Based Device, Natural Computing, 10(1), 541-550, 2010. |
| 58. | Md. Mostofa Ali Patwary, Md. Saidur Rahman, Minimum Face-Spanning Subgraphs of Plane Graphs, AKCE International Journal of Graphs and Combinatorics, 7(2), 133-150, 2010. |
| 59. | Tanveer Awal, Md. Saidur Rahman, A Linear Algorithm for Resource Tripartitioning Triconnected Planar Graphs, INFOCOMP Journal of Computer Science, 9(2), 39-48, 2010. |
| 60. | S.I. Ahmed, Masud Hasan, M.A. Islam, Cutting a Convex Polygon Out of a Circle, International Journal of Recent Trends in Engineering, 2(1), 88-92, 2009. |
| 61. | Muhammad Abdullah Adnan, Md. Saidur Rahman, Generating all distributions of objects to bins, International Journal of Computer Mathematics,, 86(3), 383 - 392, 2009. |
| 62. | Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain, Md. Saidur Rahman, Pairwise compatibility graphs, Journal of Applied Mathematics and Computing, 30, 479-503, 2009. |
| 63. | A. H. Rahman, Swakkhar Shatabda, Masud Hasan, An approximation algorithm for sorting by reversals and transpositions, Journal of Discrete Algorithms, 6(3), 449-457, 2008. |
| 64. | Masud Hasan, A Lubiw, Equiprojective polyhedra, Computational Geometry: Theory and Applications, 40(2), 148-155, 2008. |
| 65. | M. R. Rahman, Md. A. Kashem, Md. Ehtesamul Haque, An Efficient On-Line Algorithm for Edge-Ranking of Trees, INFOCOMP Journal of Computer Science, 7(2), 21-25, 2008. |
| 66. | Muhammad Abdullah Adnan, Md. Saidur Rahman, Efficient generation of evolutionary trees, INFOCOMP Journal of Computer Science,, 6(1), 30-36, 2007. |
| 67. | Muhammad Abdullah Adnan, Md. Saidur Rahman, Distribution of distinguishable objects to bins: generating all distributions, International Journal of Computer Mathematics,, 84(7), 953-965, 2007. |
| 68. | Masud Hasan, Md. Saidur Rahman, Takao Nishizeki, A linear algorithm for compact box-drawing of trees, Networks, 42(3), 160-163, 2003. |
| 69. | Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin, Orthogonal Drawings of Plane Graphs, Journal of Graph Algorithms and Applications (JGAA), 7(4), 335-362, 2003. |
| 70. | Abu Wasif, Mofizur Rahman Chowdhury, Application of Dynamic Programming Principle inDecision Tree Construction, Journal of Computer Science and Informatics, , , 1999. |
| 71. | Abu Wasif, Mofizur Rahman Chowdhury, Construction of Classification Trees by the Criterion of Attribute Dependency, Journal of Electrical Engineering, , , 1999. |
| 72. | A. S. Islam, M. Sohel Rahman, On the protein folding problem in 2D-triangular lattices, Algorithms for Molecular Biology, 8(30), , 0000. |
| 73. | Masud Hasan, T. M. Moosa, M. Sohel Rahman, Cache Oblivious Algorithms for the RMQ and the RMSQ Problems, Mathematics in Computer Science (MCS), 3(4), 433-442, 0000. |
| 74. | S. Ahmed, Shin-ichi Nakano, Md. Saidur Rahman, One-Dimensional r-Gathering under Uncertainty, Algorithmic Aspects in Information and Management - 13th International Conference, , 1-15, 2019. |
| 75. | S. Ahmed, Shin-ichi Nakano, Md. Saidur Rahman, r-Gatherings on a Star, WALCOM 2019, , 31-42, 2019. |
| 76. | Abu Reyan Ahmed, Md. Saidur Rahman, Stephen G. Kobourov, Online Facility Assignment. :, WALCOM 2018, , 156-168, 2018. |
| 77. | Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano, Floorplans with Columns, COCOA 2017, , 33-40, 2017. |
| 78. | Sujoy Das, S. Sharmin, Md. Saidur Rahman, Proactive Humanitarian Aid Networks with Guided Topology and Small-World Effect, The fifth IEEE Region 10 (Asia Pacific) Humanitarian Technology Conference (R10HTC) 2017, 1(1), 682-685, 2017. [paper link] |
| 79. | S. Ahmed, Md. Saidur Rahman, Multi-interval Pairwise Compatibility Graphs, Theory and Applications of Models of Computation , , 71-84, 2017. |
| 80. | Dipan Shaw, A. S. Islam, Shuvasish Karmaker, M. Sohel Rahman, Approximation Algorithms for Three Dimensional Protein Folding, WALCOM, , 274-285, 2016. |
| 81. | Frantisek Franek, A. S. Islam, M. Sohel Rahman, William Smyth, Algorithms to compute the Lyndon array, Prague Stringology Conference, , 172-184, 2016. |
| 82. | Md. Iqbal Hossain, Md. Saidur Rahman, A necessary condition and a sufficient condition for pairwise compatibility graphs, WALCOM 2016, , 107-113, 2016. |
| 83. | Md. Shaifur Rahman, Mahmuda Naznin, T. Ahmed, Efficient Routing in a Sensor Network Using Collaborative Ants, The 7th International Conference on Swarm Intelligence, LNCS 9713, , , 2016. [paper link] |
| 84. | Md. Iqbal Hossain, Shaheena Sultana, Nazmun Nessa Moon, Tahsina Hashem, Md. Saidur Rahman, On Triangle Cover Contact Graphs. WALCOM 2015: 323-328, WALCOM 2015, , 323-328, 2015. |
| 85. | Md. Mahbubul Hasan, A. S. Islam, Mohammad Saifur Rahman, M. Sohel Rahman, Order Preserving Prefix Tables, International Symposium on String Processing and Information Retrieval (SPIRE), , 111-116, 2014. [paper link] |
| 86. | Md. Sazzadur Rahaman, Tousif Ahmed, Sad Al Abdullah, Md. Saidur Rahman, Antibandwidth problem for itchy caterpillars, International Conference on Informatics, Electronics & Vision (ICIEV), 2014, , 1-6, 2014. |
| 87. | N. Khan, N. Karima, Md. Saidur Rahman, Md. Iqbal Hossain, Orthogonal grid pointset embeddings of maximal outerplanar graphs, International Conference on Electrical Engineering and Information & Communication Technology (ICEEICT), 2014, , 1-6, 2014. |
| 88. | Md. Iqbal Hossain, Md. Saidur Rahman, Monotone Grid Drawings of Planar Graphs, FAW 2014, , 105-116, 2014. |
| 89. | Shaheena Sultana, Md. Saidur Rahman, Arpita Roy, Suraiya Tairin, Bar 1-Visibility Drawings of 1-Planar Graphs, ICAA 2014, 8321, , 2014. |
| 90. | K. M. Shahriar, Md. Saidur Rahman, Bichromatic Point-Set Embeddings of Trees with Fewer Bends, WALCOM 2014, , 337-348, 2014. |
| 91. | S. Sharmin, F. Manne, Efficient Counting of Maximal Independentsets in Sparse Graphs, Proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013,, 7933, 103-114, 2013. [paper link] |
| 92. | S.M. Ferdous, M. Sohel Rahman, Solving the Minimum Common String Partition Problem with the Help of Ants, International Conference on Swarm Intelligence (LNCS 7929), , 306-313, 2013. |
| 93. | Md. Shaifur Rahman, Mahmuda Naznin, Shortening the Tour-Length of a Mobile Data Collector in the WSN by the Method of Linear Shortcut, The 15th Asia-Pacific Web Conference (APWeb), LNCS 7808, , 674-685, 2013. [paper link] |
| 94. | Stephane Durocher, Debajyoti Mondal, Md. Saidur Rahman, On Graphs That Are Not PCGs, WALCOM 2013, , 310-321, 2013. |
| 95. | Muhammad Abdullah Adnan, Zonohedra, Zone Graphs, and Their Linear Area Straight Line Grid Drawings, Workshop on Graph Drawing and Graph Algorithms (GDGA), , , 2012. |
| 96. | Abu Reyan Ahmed, Md. Mazharul Islam, Md. Saidur Rahman, On acyclic colorings of graphs, 15th International Conference on Computer and Information Technology (ICCIT 2012), , 95-100, 2012. |
| 97. | Md. Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman, On Some Properties of Doughnut Graphs, IWOCA 2012, , 60-64, 2012. |
| 98. | Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides, Acyclic Coloring with Few Division Vertices, IWOCA 2012, , 86 - 99, 2012. |
| 99. | S.M. Ferdous, Anindya Das, M. Sohel Rahman, Md. Mustafizur Rahman, An Ant Colony Optimization approach to solve the Minimum String Cover Problem, 1st IEEE/OSA/IAPR International Conference on Informatics, Electronics and Vision, , 741-746, 2012. |
| 100. | Sumaiya Iqbal, M. Sohel Rahman, VEHICLE ROUTING PROBLEMS WITH SOFT TIME WINDOWS, ICECE, , , 2012. |
| 101. | Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman, Computing a Longest Common Palindromic Subsequence, IWOCA, , , 2012. |
| 102. | Sumaiya Nazeen, Tanaeem M Moosa, M. Sohel Rahman, Rezwana Reaz Rimpi, Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet, WALCOM, , 160-172, 2012. |
| 103. | E. Farhana, M. Sohel Rahman, Efficient Algorithm for Restricted LCS Problem, 4th International Conference on Bioinformatics and Computational Biology (BiCOB), , 51-56, 2012. |
| 104. | Sammi Abida Salma, Md. Saidur Rahman, Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs, WALCOM, , 112-123, 2012. |
| 105. | J. S. Firoz, M. Sohel Rahman, T. K. Saha, Bee Algorithms for Solving DNA Fragment Assembly Problem with Noisy and Noiseless data, GECCO, , , 2012. |
| 106. | S. Sharmin, J. A. Telle, M. Vatshelle, E. M. Hvidevold, Finding good decompositions for dynamic programming on dense graphs, Proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, 7112, 219-231, 2011. [paper link] |
| 107. | A. Dumitrescu, Masud Hasan, Cutting Out Polygons with a Circular Saw, In Proc. 22nd International Symposium on Algorithms and Computation, , 230-239, 2011. |
| 108. | Tonmoy Guha Roy, Sourabh Aryabhatta, Md. Mohsin Uddin, Md. Saidur Rahman, On Graceful Labelings of Trees, WALCOM, , 214-220, 2011. |
| 109. | Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman, Acyclic Colorings of Graph Subdivisions, International Workshop on Combinatorial Algorithms (IWOCA)., , , 2011. |
| 110. | Nurjahan Begum, Samia Tasnim, Mahmuda Naznin, Efficient Query Processing in Sensor Network Using Multi-commodity Flow Network, The 17th IEEE International Conference on Industrial Engineering and Management, , , 2010. [paper link] |
| 111. | Tanveer Awal, Md. Saidur Rahman, A linear algorithm for resource four-partitioningfour-connected planar Graphs, In Proceedings of the 6th International Conference on Electrical and Computer Engineering (ICECE), , 526 - 529, 2010. |
| 112. | M.R Islam, M. Sohel Rahman, Masud Hasan, M.M. Hasan, IMIPS: An improved pipelined processor architecture with reduced branch penalty and single memory for instruction and data, International International Conference on Computer Engineering and Applications (, , , 2010. |
| 113. | S.I. Ahmed, Masud Hasan, A. Sopan, Vindictive Voronoi games and stabbing Delaunay circles, International Symposium on Voronoi Diagram in Science and Engineering, , 124-131, 2010. |
| 114. | Masud Hasan, Non-)Equiprojectivity and (Non-)Biprojectivity of Simplicial Polyhedra, 20th Annual Fall Workshop on Computational Geometry (FWCG 2010),, , , 2010. |
| 115. | Masud Hasan, S. Hossain, M.M.M. Rahman, Solving the minimum hitting set problem with a light-based device, International Conference on Electrical and Computer (ICECE), , 423-426, 2010. |
| 116. | M. A. Wahid, M. Kaykobad, Masud Hasan, Kinetisation of view of 3D point set, International Conference on Computer and Information Technology (ICCIT), , 325-330, 2010. |
| 117. | J. S. Firoz, Masud Hasan, A. Z. Khan, M. Sohel Rahman, The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time (Conference, WALCOM, , , 2010. |
| 118. | S. B. Ahsan, T. M. Moosa, M. Sohel Rahman, Shampa Shahriyar, Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded (Conference, Mini-conference on Applied Theoretical Computer Science, MATCOS, , 366-369, 2010. |
| 119. | Mahfuza Sharmin, R. Yeasmin, Masud Hasan, A. Rahman, M. Sohel Rahman, Pancake Flipping with Two Spatulas, ISCO 2010 Proceedings: Electronic Notes in Discrete Mathematics, , 231-238, 2010. |
| 120. | M. Crochemore, Masud Hasan, T. M. Moosa, M. Sohel Rahman, Two dimensional Range Minimum/Maximum Query revisited, 13th International Conference on Computer and Information Technology (ICCIT), , 27 - 32, 2010. |
| 121. | Masud Hasan, S. M. S. Hossain, M. M. Rahman, M. Sohel Rahman, Solving Minimum Hitting Set Problem with a Light-Based Device, International Conference on Electrical and Computer Engineering (ICECE), , 423 - 426, 2010. |
| 122. | Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-ichi Nakano, Generating all triangulations of plane graphs, WALCOM 2009, , 151-164, 2009. |
| 123. | M.M.M. Khan, A.K. Biswas, S. Chowdhury, Masud Hasan, A.I. Khan, Synthesis of GF(3) based ternary reversible/quantum logic circuits without ancillary qutrits, International Symposium on Multi-Valued Logic 2009, , , 2009. |
| 124. | Atif Rahman, Mahmuda Naznin, Masud Hasan, Integer Linear Programming in Designing Universal Arrays with Multiplexed Applications, International Conference on Electronics and Computer Technology, , 215-218, 2009. |
| 125. | M. M. Rasheed, Masud Hasan, M. Sohel Rahman, Maximum Neighbour Voronoi Games, WALCOM, , 93-104, 2009. |
| 126. | Masud Hasan, S. Hossain, M. M. Rahman, M. Sohel Rahman, An Optical Solution for the Subset Sum Problem, the Fourth International Workshop on Natural Computing (IWNC), , 165-173, 2009. |
| 127. | Md. Shariful Islam Bhuyan, Md. Saidur Rahman, Efficient Generation of Combinatorial Families, 11th International Conference on Computer and Information Technology (ICCIT 2008), , 25-30, 2008. |
| 128. | Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain, Md. Saidur Rahman, Pairwise compatibility graphs, WALCOM 2008, , 222-233, 2008. |
| 129. | M. Ahmed, S.M.H Chowdhury, Masud Hasan, Fast preemptive task scheduling algorithm for homogeneous and heterogeneous distributed memory systems, ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, , , 2008. |
| 130. | Masud Hasan, M.M. Hossain, S. Nusrat, A. Lopez-Ortiz, Smallest and some new equiprojective polyhedra, International Conference on Computer and Information Technology, , , 2008. |
| 131. | Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman, Maximum neighbor Voronoi games, Annual Workshop on Algorithms and Computation (WALCOM 2009), , , 2008. |
| 132. | Md. Rezaul Karim, Md. Saidur Rahman, Four-Connected Spanning Subgraphs of Doughnut Graphs, WALCOM, , 132-143, 2008. |
| 133. | Muhammad Abdullah Adnan, Md. Saidur Rahman, Efficient generation of evolutionary trees, International Conference on Information and Communication Technology (ICICT 2007), , 6, 2007. |
| 134. | S. Sharmin, Md. Monirul Islam, D. Barua, A. Mahmood, Graph Matching Recombination for Evolving Neural Networks, Proceedings of the European Symposium on Artificial Neural Networks, ESANN 2007, 4492(1), 562-568, 2007. [paper link] |
| 135. | Muhammad Abdullah Adnan, Distribution of distinguishable objects to bins: generating all distributions, Workshop on Algorithms and Computation (WALCOM), , , 2007. |
| 136. | Mahmuda Naznin, Paul Juell, Kendall E. Nygard, Karl Altenburg, A Clustering Heuristic by Effective Neighbor Selection, The 40th Annual Midwest Instructional and Computing Symposium (MICS), , 6, 2007. |
| 137. | M. R. Rahman, Md. Ehtesamul Haque, M. Islam, Md. A. Kashem, On-Line Algorithms for Vertex-Rankings of Graphs, Proc. of the International Conference on Information and Communication Technology (ICICT 2007), , 22-26, 2007. |
| 138. | A Khan, N. Shahriar, S.M. Khan, Masud Hasan, Novel realization of quantum ternary mux and demux, . International Conference on Electrical and Compute Engineering, , , 2006. |
| 139. | A. Khan, N. Nusrat, S.M. Khan, Masud Hasan, Novel realization of some ternary circuits for quantum computing, IEEE TENCON, , , 2006. |
| 140. | Muhammad Abdullah Adnan, Md. Saidur Rahman, Distribution of objects to bins: generating all distributions, Proc. of 9th International Conference on Computer and Information Technology (ICCIT 2006), , 297-302, 2006. |
| 141. | M. R. Rahman, Md. A. Kashem, Md. Ehtesamul Haque, An On-Line Algorithm for Edge-Ranking of Trees, Proc. of the 9th International Conference on Computer and Information Technology, , 51-54, 2006. |
| 142. | A. Bhattacharjee, Md. R. Uddin, B. K. Debnath, DQA: Automata with new Memories, Properties and Applications, 8th International Conference on Computer and Information Technology, , , 2005. |
| 143. | A. Bhattacharjee, S. A. Quader, A New Approach to File Encryption and Compression, 8th International Conference on Computer and Information Technology, , , 2005. |
| 144. | M. Sohel Rahman, M. Kaykobad, Mohammad Saifur Rahman, A New Sufficient Condition for the Existence of Hamiltonian Paths, 0th International Conference on Computers and Their Applications (CATA), , , 2005. |
| 145. | A. Bhattacharjee, B. K. Debnath, Queue Automata, 7th International Conference on Computer and Information Technology, , , 2004. |
| 146. | Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki, Orthogonal drawings of plane graphs without bends, International Conference on Graph Drawing, LNCS 2265, 7(4),, 392-406, 2003. |
| 147. | M. A. Kashem, M.A.H. Newton, Parallel Algorithm for Optimal c-Vertex-Ranking of Permutation Graphs, nternational Conference on Computer and Information Technology, , 55-60, 2002. |
| 148. | A. H. Tamal, M. S. Rahman, M. Sohel Rahman, M. Kaykobad, On Average Length of Cycles in Complete Graphs, 5th International Conference on Computer and Information Technology (ICCIT), , 47-49, 2002. |
| 149. | M. Kaykobad, Asif-ul Haque , Mohammad Saifur Rahman, M. Sohel Rahman, On Average Length of Cycle in a Complete Graph, International Conference on Computer and Information Technology, , 47-49, 2002. |
| 150. | M. A. Kashem, M.A.H. Newton, An efficient algorithm for optimal vertex-ranking of permutation graphs, International Conference on Computer and Information Technology, Dhaka, Bangladesh, , 315-320, 1999. |
| 151. | Abu Wasif, Mofizur Rahman Chowdhury, Increasing the Performance of Classification Trees by Using a Mixed Criterion of Attribute Dependency and Gain Ratio, International Conference on Computer and Information Technology, , , 1998. |
| 152. | Abu Wasif, Mofizur Rahman Chowdhury, Construction of Decision Trees by Using the Criterion of Class-dependency, International Conference on Computer and Information Technology, , , 1998. |
| 153. | M Khan, Quantum realization of some quaternary circuits, , , , 0000. |
| 154. | S.B. Ahsan, S.P. Aziz, M. Sohel Rahman, Longest Common Subsequence Problem for Run-Length-Encoded Strings, Journal of Computers, 9(8), 1769-1775, 2014. |
